A Geometric Littlewood-richardson Rule

نویسنده

  • RAVI VAKIL
چکیده

We describe an explicit geometric Littlewood-Richardson rule, interpreted as deforming the intersection of two Schubert varieties so that they break into Schubert varieties. There are no restrictions on the base field, and all multiplicities arising are 1; this is important for applications. This rule should be seen as a generalization of Pieri’s rule to arbitrary Schubert classes, by way of explicit homotopies. It has a straightforward bijection to other Littlewood-Richardson rules, such as tableaux and Knutson and Tao’s puzzles. This gives the first geometric proof and interpretation of the Littlewood-Richardson rule. It has a host of geometric consequences, described in [V2]. The rule also has an interpretation in -theory, suggested by Buch, which gives an extension of puzzles to -theory. The rule suggests a natural approach to the open question of finding a Littlewood-Richardson rule for the flag variety, leading to a conjecture, shown to be true up to dimension 5. Finally, the rule suggests approaches to similar open problems, such as Littlewood-Richardson rules for the symplectic Grassmannian and two-flag varieties. CONTENTS

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An algorithmic Littlewood-Richardson rule

We introduce a Littlewood-Richardson rule based on an algorithmic deformation of skew Young diagrams and present a bijection with the classical rule. The result is a direct combinatorial interpretation and proof of the geometric rule presented by Coskun (2000). We also present a corollary regarding the Specht modules of the intermediate diagrams.

متن کامل

Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients

We point out that the remarkable Knutson and Tao Saturation Theorem [9] and polynomial time algorithms for linear programming [14] have together an important, immediate consequence in geometric complexity theory [15, 16]: The problem of deciding positivity of Littlewood-Richardson coefficients belongs to P ; cf.[10]. Specifically, for GLn(C), positivity of a Littlewood-Richardson coefficient cα...

متن کامل

Littlewood-Richardson fillings and their symmetries

Abstract Considering the classical definition of the Littlewood-Richardson rule and its 2-dimensional representation by means of rectangular tableaux, we exhibit 24 symmetries of this rule when considering dualization, conjugation and their composition. Extending the Littlewood-Richardson rule to sequences of nonnegative real numbers, six of these symmetries may be generalized. Our point is to ...

متن کامل

Symmetric Skew Quasisymmetric Schur Functions

The classical Littlewood-Richardson rule is a rule for computing coefficients in many areas, and comes in many guises. In this paper we prove two Littlewood-Richardson rules for symmetric skew quasisymmetric Schur functions that are analogous to the famed version of the classical Littlewood-Richardson rule involving Yamanouchi words. Furthermore, both our rules contain this classical Littlewood...

متن کامل

A Combinatorial Proof That Schubert vs. Schur Coefficients Are Nonnegative

We give a combinatorial proof that the product of a Schubert polynomial by a Schur polynomial is a nonnegative sum of Schubert polynomials. Our proof uses Assaf’s theory of dual equivalence to show that a quasisymmetric function of Bergeron and Sottile is Schur-positive. By a geometric comparison theorem of Buch and Mihalcea, this implies the nonnegativity of Gromov-Witten invariants of the Gra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003